A $1 Problem

نویسنده

  • Michael J. Mossinghoff
چکیده

1. INTRODUCTION: MAKING MONEY. With a title like this, one might expect to find described here some unsolved problem assigned a decidedly paltry bounty by a strapped mathematical institute, or perhaps a pet question from an eccentric, but thrifty, individual. Indeed, this is an article about how to make money, but it is not at all about some scheme to earn income. Rather, it concerns how actually to make money, specifically, how to design a one-dollar coin. The United States has had little success in the last quarter century with its dollar coins. The Susan B. Anthony dollar was introduced in 1979, but with its round shape, silvery appearance, and milled edge, it was too similar to the quarter to gain much acceptance in everyday commerce. It was discontinued after only three years (though it appeared again briefly in 1999). In 2000, the Sacagawea dollar was put into circulation , and this coin is certainly more distinctive, with a golden color and a smooth edge. However, it has never gained wide acceptance in the U.S., no doubt in large part because one-dollar bills continue to be produced by the Bureau of Engraving and Printing. In contrast, Canada replaced its dollar bills with a very successful coin in 1989, the " loonie. " It is bronze in appearance, has no milled edge, and sports a polygonal shape. Its eleven sides give it a distinctive feel when fumbling for change at a bus stop or a newspaper stand. So perhaps redesigning the U.S. coin to have a unique shape would aid its acceptance in everyday circulation. Suppose then that you have been appointed by the Department of the Treasury to oversee the creation of a new one-dollar coin for circulation in the U.S. You quickly realize that many parties have great interest in the design and shape of the new coin.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An employee transporting problem

An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...

متن کامل

An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem

A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...

متن کامل

Bifurcation in a variational problem on a surface with a constraint

We describe a variational problem on a surface under a constraintof geometrical character. Necessary and sufficient conditions for the existence ofbifurcation points are provided. In local coordinates the problem corresponds toa quasilinear elliptic boundary value problem. The problem can be consideredas a physical model for several applications referring to continuum medium andmembranes.

متن کامل

An Iterative Scheme for Generalized Equilibrium, Variational Inequality and Fixed Point Problems Based on the Extragradient Method

The problem ofgeneralized equilibrium problem is very general in the different subjects .Optimization problems, variational inequalities, Nash equilibrium problem and minimax problems are as special cases of generalized equilibrium problem. The purpose of this paper is to investigate the problem of approximating a common element of the set of generalized equilibrium problem, variational inequal...

متن کامل

A Continuous Optimization Model for Partial Digest Problem

The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simp...

متن کامل

Fully Fuzzy Transportation Problem

Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The American Mathematical Monthly

دوره 113  شماره 

صفحات  -

تاریخ انتشار 2006